Safe sets in graphs: Graph classes and structural parameters
نویسندگان
چکیده
منابع مشابه
Collapse closed classes of graphs and graph parameters
We characterize classes of multi-graphs that by a transformation of Schrijver give so called invariant ring in tensor algebra. This property enables us subsequently to show, that whenever we have an edge reflection positive and multiplicative graph parameter defined on this class such that its value on vertexless loop is a natural number, it can be represented in edge coloring model.
متن کاملStructural Results for Equistable Graphs and Related Graph Classes
The class of equistable graphs is defined by the existence of a weight structure on the vertices where maximal stable sets are characterized by their weights. This class, not contained in any nontrivial hereditary class, has been studied both from a structural and an algorithmic point of view, however no combinatorial characterization is known for these graphs. We present some structural result...
متن کاملKernelization Using Structural Parameters on Sparse Graph Classes
Meta-theorems for polynomial (linear) kernels have been the subject of intensive research in parameterized complexity. Heretofore, there were meta-theorems for linear kernels on graphs of bounded genus, H-minor-free graphs, and H-topological-minor-free graphs. To the best of our knowledge, there are no known meta-theorems for kernels for any of the larger sparse graph classes: graphs of bounded...
متن کاملExtremal Parameters in Sub-Critical Graph Classes
We analyze several extremal parameters like the diameter or the maximum degree in sub-critial graph classes. Sub-critical graph classes cover several well-known classes of graphs like trees, outerplanar graph or series-parallel graphs which have been intensively studied during the last few years. However, this paper is the first one, where these kind of parameters are studied from a general poi...
متن کاملMinimal Dominating Sets in Graph Classes: Combinatorial Bounds and Enumeration
The maximum number of minimal dominating sets that a graph on n vertices can have is known to be at most 1.7159. This upper bound might not be tight, since no examples of graphs with 1.5705 or more minimal dominating sets are known. For several classes of graphs, we substantially improve the upper bound on the maximum number of minimal dominating sets in graphs on n vertices. In some cases, we ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Combinatorial Optimization
سال: 2017
ISSN: 1382-6905,1573-2886
DOI: 10.1007/s10878-017-0205-2